高铁站功能区布局优化模型研究

为使高铁站功能区的布局更加科学合理,论文以旅客在高铁站房内的平均走行时间最少和高铁站建造成本最低为目标,综合考虑功能区的面积、长宽比例、功能区禁止重叠、流线等约束条件,构建基于多目标混合规划的高铁站功能区布局优化模型,通过算例验证了模型的有效性。该方法得出的结论可以为高铁站功能区布局的规划设计提供参考。     

高铁无柱雨棚工程造价估算与敏感性分析

影响高铁客运站无柱雨棚结构工程造价的因素很多,在收集已建高铁客运站无柱雨棚结构工程造价数据的基础上,针对侧式客站无柱雨棚结构工程造价选取了相应的几个主要影响变量。根据多元回归分析理论,分别建立了多元逐步线性回归模型和二次响应曲面模型,通过拟合模型的对比分析与实例验证,提出二次响应曲面模型在高铁侧式站无柱雨棚结构工程造价估算上的应用前景。并在此基础上,应用二次响应曲面模型研究得出各主要敏感因素对无柱雨棚结构工程造价的敏感程度。从投资角度为高铁侧式站无柱雨棚结构体系设计和建设提供了优化方向。     

普速与CTCS-2客运专线车站特殊站联电路工程设计

结合秦沈沟海联络线的工程应用实例,当客运专线车站与普速车站区间设有通过信号机,且客运专线车站所辖区间采用CTCS-2级列控系统编码,而普速车站所辖区间采用无绝缘轨道电路继电编码时;为满足普速车站站内联锁及电码化对离去轨继电器的要求,设计出了两种解决方案,对类似工程设计具有借鉴意义。     

现代有轨电车合理站间距研究

现代有轨电车在组团式城市有着良好的区域适用性。通过分析现代有轨电车车站分布对吸引客流、乘客出行时间、工程造价和项目运营的影响,为站点布设提供理论基础。以运营效率最优兼顾乘客节约出行时间效益为目标,从车站工程费用、运营费用(车辆购置费)、运营收入(车费收入)和乘客节约出行时间效益4个部分建立有轨电车站间距优化模型;并用Matlab编程求解,结合成都市IT大道现代有轨电车工程的相关资料,对模型进行实证分析。结果表明:现代有轨电车能实现70 km/h速度的最小站间距为0.631 km,一般现代有轨电车的合理站间距为0.5~0.9 km;该优化模型计算结果与工程实际吻合度较高,可以为现代有轨电车车站分布提供借鉴和参考。     

基于Cross-efficiency DEA的中间站运营绩效分析

根据传统DEA存在的局限性,在有关文献研究的基础上,提出了基于Cross-efficiency DEA模型的中间站绩效分析方法,在调查收集影响中间站运营绩效基础数据的基础上,利用灰色关联分析法提取了评价指标体系,采用Cross-efficiency DEA模型对中间站运营绩效进行了分析、评价和测算,并运用MATLAB软件编程进行了求解,获得了各中间站源配置效率的排序,在对非DEA有效的决策单元进行投影分析的基础上,识别出影响决策单元运营绩效的关键因素,为改进非DEA有效决策单元提供了一个可行方案.最后利用实例验证了该模型的有效性、科学性,分析结果表明:Cross-efficiency DEA模型基本能够反映决策单元运行效率的现实状况.     

轨道交通大客流换乘站客流组织仿真分析——以深圳会展中心站为例

为有效应对轨道交通网络化运营初期可能出现的客流拥挤等问题,运用行人仿真方法进行客流组织方案的动态检验和调整。以深圳会展中心站为例,选取适当的仿真参数和评价指标,对车站客流组织进行防真,分析客流拥堵原因,提出客流组织调整方案,并对调整方案进行仿真及评阶。总结了车站行人仿真在指导车站客流组织方面的普遍适用性。     

遗传算法在区段站到发线的应用研究

为解决车站到发线的合理运用问题，采用遗传算建立了到发线运用的染色体结构和适应度函数，对这种复杂的非线性组合优化问题进行了仿真。     

Free-floating bike sharing: Solving real-life large-scale static rebalancing problems

Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the success of FFBS depends on the efficiency of its rebalancing operations to serve the maximal demand as possible.Bicycle rebalancing refers to the reestablishment of the number of bikes at sites to desired quantities by using a fleet of vehicles transporting the bicycles. Static rebalancing for SBBS is a challenging combinatorial optimization problem. FFBS takes it a step further, with an increase in the scale of the problem. This article is the first effort in a series of studies of FFBS planning and management, tackling static rebalancing with single and multiple vehicles. We present a Novel Mixed Integer Linear Program for solving the Static Complete Rebalancing Problem. The proposed formulation, can not only handle single as well as multiple vehicles, but also allows for multiple visits to a node by the same vehicle. We present a hybrid nested large neighborhood search with variable neighborhood descent algorithm, which is both effective and efficient in solving static complete rebalancing problems for large-scale bike sharing programs.Computational experiments were carried out on the 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP) instances used previously in the literature and on three new sets of instances, two (one real-life and one general) based on Share-A-Bull Bikes (SABB) FFBS program recently launched at the Tampa campus of University of South Florida and the other based on Divvy SBBS in Chicago. Computational experiments on the 1-PDTSP instances demonstrate that the proposed algorithm outperforms a tabu search algorithm and is highly competitive with exact algorithms previously reported in the literature for solving static rebalancing problems in SBSS. Computational experiments on the SABB and Divvy instances, demonstrate that the proposed algorithm is able to deal with the increase in scale of the static rebalancing problem pertaining to both FFBS and SBBS, while deriving high-quality solutions in a reasonable amount of CPU time.     

技术站间货物列车协同配流方案研究

技术站间货物列车协同作业组织模式，可实现各站获益，整体加强，对提升铁路运输生产效率具有重要意义.本文建立技术站间货物列车协同配流模型.模型以最大化两技术站的正点出发列车数作为目标函数，采用启发式遗传算法进行寻优，得到货物列车解编顺序和配流方案.最后，通过对算例进行实验分析，验证协同配流模型的实用性.结果表明，技术站间协同配流作业明显压缩车辆在站总停留时间，增加了阶段计划内正点出发列车数，进而提高了技术站内线路使用能力.     

马来西亚东海岸铁路CTCS-2级列控系统方案研究

对马来西亚东海岸铁路CTCS-2级列控系统方案进行了分析和研究;针对单线自动站间闭塞情况提出了CTCS-2级列控系统方案;通过综合比较后提出马来西亚东海岸铁路列控系统推荐方案,可为CTCS-2级列控系统在单线自动站间闭塞中的应用提供一定参考.